Monotonic and Downward Closed Games

نویسندگان

  • Parosh Aziz Abdulla
  • Ahmed Bouajjani
  • Julien d'Orso
چکیده

In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109–127)] we presented a general framework for verification of infinite-state transition systems, where the transition relation is monotonic with respect to a well quasi-ordering on the set of states. In this article, we investigate extending the framework from the context of transition systems to that of games with infinite state spaces. We show that monotonic games with safety winning conditions are in general undecidable. In particular, we show this negative results for games which are defined over Petri nets. We identify a subclass of monotonic games, called downward closed games. We provide algorithms for analysing downward closed games subject to safety winning conditions. We apply the algorithm to games played on lossy channel systems. Finally, we show that weak parity games are undecidable for the above classes of games.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deciding Monotonic Games

In an earlier work [AČJYK00] we presented a general framework for verification of infinite-state transition systems, where the transition relation is monotonic with respect to a well quasi-ordering on the set of states. In this paper, we investigate extending the framework from the context of transition systems to that of games. We show that monotonic games are in general undecidable. We identi...

متن کامل

A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games

Abstract   This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...

متن کامل

Simple games on closure spaces

Let N be a ...nite set. By a closure space we mean the family of the closed sets of a closure operator on 2 satisfying the additional condition ; = ;. A simple game on a closure space L is a function v : L ! f0; 1g such that v(;) = 0 and v (N) = 1. We assume simple games are monotonic. The coalitions are the closed sets of L and the players are the elements i 2 N . We will give results concerni...

متن کامل

A note on the monotonicity and superadditivity of TU cooperative games∗

In this note we make a comparison between the class of monotonic TU cooperative games and the class of superadditive TU cooperative games. We first provide the equivalence between a weakening of the class of superadditive TU games and zero-monotonic TU games. Then, we show that zero-monotonic TU games and monotonic TU games are different classes. Finally, we show under which restrictions the cl...

متن کامل

A game Theoretic Approach to Pricing, Advertising and Collection Decisions adjustment in a closed-loop supply chain

This paper considers advertising, collection and pricing decisions simultaneously for a closed-loop supplychain(CLSC) with one manufacturer(he) and two retailers(she). A multiplicatively separable new demand function is proposed which influenced by pricing and advertising. In this paper, three well-known scenarios in the game theory including the Nash, Stackelberg and Cooperative games are expl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2008